Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
نویسندگان
چکیده
منابع مشابه
Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches
Proofs from complexity theory as well as computational experiments indicate that most lot sizing problems are hard to solve. Because these problems are so difficult, various solution techniques have been proposed to solve them. In the past decade, meta-heuristics such as tabu search, genetic algorithms and simulated annealing, have become popular and efficient tools for solving hard combination...
متن کاملExact solution approaches for bilevel lot-sizing
In this paper we propose exact solution methods for a bilevel uncapacitated lot-sizing problem with backlogs. This is an extension of the classical uncapacitated lot-sizing problem with backlogs, in which two autonomous and self-interested decision makers constitute a twoechelon supply chain. The leader buys items from the follower in order to meet external demand at lowest cost. The follower a...
متن کاملHeuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: a comparison study
1 Departamento de Engenharia de Produção, Universidade Federal de Sao Carlos, C.P. 676, 13565-905, Sao Carlos, SP, Brazil [email protected]; [email protected] 2 Departamento de Matemática, Estat́ıstica e Computação, Universidade Estadual Paulista, C.P. 1234, 19060-400, Presidente Prudente, SP, Brazil [email protected] 3 Dept. of Technology and Operations Management, Univers...
متن کاملImproved formulations, heuristics and metaheuristics for the dynamic demand coordinated lot-sizing problem
Improved Formulations, Heuristics and Metaheuristics for the Dynamic Demand Coordinated Lot-sizing Problem. (August 2006) Arunachalam Narayanan, B.E., Anna University, India; M.S., Texas A&M University Chair of Advisory Committee: Dr. E. Powell Robinson Coordinated lot sizing problems, which assume a joint setup is shared by a product family, are commonly encountered in supply chain contexts. T...
متن کاملProgressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
We consider a family of N items that are produced in, or obtained from, the same production facility. Demands are deterministic for each item and each period within a given horizon of T periods. If in a given period an order is placed, setup costs are incurred. The aggregate order size is constrained by a capacity limit. The objective is to find a lot-sizing strategy that satisfies the demands ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2007
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2005.12.008